Unification modulo an equality theory for equational logic programming
نویسندگان
چکیده
منابع مشابه
Unification Modulo an Equality Theory for Equational Logic Programming
Equational logic programming is an extended programming paradigm of equational programming. Central to the notion of equational logic programming is the problem of solving equations, which is also called unification in equational theories. In this paper, we investigate the problem of solving equations in O’Donnell’s equational language. We define an equality theory for this language which adequ...
متن کاملImplementing Anti-Unification Modulo Equational Theory
We present an implementation of E–anti–unification as defined in [Hei95], where tree–grammar descriptions of equivalence classes of terms are used to compute generalizations modulo equational theories. We discuss several improvements, including an efficient implementation of variable–restricted E–anti–unification from [Hei95], and give some runtime figures about them. We present applications in...
متن کاملUnification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملUnification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining
We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element. By interpreting a particular symbol of this signature suitably, the rewrite system can model several practical situations of interest. An inference procedure is pres...
متن کاملReflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1991
ISSN: 0022-0000
DOI: 10.1016/0022-0000(91)90039-8